Papers with low-rank decomposition

5 papers
MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition (2024.findings-emnlp)

Copied to clipboard

Challenge: emergence of Mixture of Experts (MoE) LLMs has significantly advanced the development of language models.
Approach: They propose a two-stage compression method tailored for Mixture of Experts to reduce the model size and decrease the computational cost.
Outcome: The proposed method reduces model size and improves inference efficiency while maintaining performance in various zero-shot tasks.
MoKA:Parameter Efficiency Fine-Tuning via Mixture of Kronecker Product Adaption (2025.coling-main)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is one of the most popular PEFT methods . low-rank update mechanism of LoRA somewhat limits its ability to approximate full-parameter fine-tuning during training process.
Approach: They propose a parameter-efficient fine-tuning framework that combines Kronecker product with the Mixture-of-Experts method to achieve parameter efficiency and better model performance.
Outcome: The proposed framework outperforms existing methods on the GLUE benchmark and instruction tuning tasks for large language models.
Sensitivity-LoRA : Low-Load Sensitivity-Based Fine-Tuning for Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is a promising approach to adapting LLMs to specialized tasks . existing rank allocation techniques remain computationally inefficient and unstable .
Approach: They propose a low-rank adapted model that approximates model weight updates using low-ranked decomposition.
Outcome: The proposed method is limited by its uniform rank allocation to each incremental matrix . it leverages the second-order derivatives of the loss function to capture weight sensitivity .
Correlation-Aware Example Selection for In-Context Learning with Nonsymmetric Determinantal Point Processes (2025.emnlp-main)

Copied to clipboard

Challenge: Existing studies on in-context learning (ICL) focus on the selection of individual examples and ignore correlations among examples.
Approach: They propose a method to capture positive and negative correlations using the determinantal point process . they optimize the method via kernel decomposition-based MLE to fit a constructed pseudo-labeled dataset .
Outcome: The proposed method outperforms baselines in ICL example selection.
Break Through the Compression Bottleneck: From Theory to Practice (2026.findings-acl)

Copied to clipboard

Challenge: Existing compression methods suffer from bottleneck issues when compression ratio is increased.
Approach: They propose a novel approach to combine low-rank decomposition and quantization methods to reduce the compression bottleneck.
Outcome: The proposed method reduces the computational and memory overhead of existing methods while maintaining model accuracy.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations